Estimating the Initial Condition of Chaotic Orbits: Performance Bounds
نویسندگان
چکیده
We derive the Cramér-Rao lower bound associated with the estimation of the initial condition of noise-embedded chaotic signals produced by general onedimensional maps. We relate its asymptotic behaviour to the chaotic attractor’s Lyapunov number. These results can be used to choose the chaotic generator more suitable for applications on chaotic digital communication systems.
منابع مشابه
On the Chaotic Orbits of Disc-Star-Planet Systems
Following Tancredi, Sànchez and Roig (2001)’s criteria of chaos, two ways of setting initial velocities are used in the numerical surveys to explore the possible chaotic and regular orbits for the disc-star-planet systems. We find that the chaotic boundary does not depend much on the disc mass for Type I initial condition, but can change a lot for different disc masses for Type II initial condi...
متن کاملMulti-Map Orbit Hopping Chaotic Stream Cipher
Abstract In this paper we propose a multi-map orbit hopping chaotic stream cipher that utilizes the idea of spread spectrum mechanism for secure digital communications and fundamental chaos characteristics of mixing, unpredictable, and extremely sensitive to initial conditions. The design, key and subkeys, and detail implementation of the system are addressed. A variable number of well studied ...
متن کاملInformation, initial condition sensitivity and dimension in weakly chaotic dynamical systems
We study generalized indicators of sensitivity to initial conditions and orbit complexity in topological dynamical systems. The orbit complexity is a measure of the asymptotic behavior of the information that is necessary to describe the orbit of a given point. The indicator generalizes, in a certain sense, the Brudno’s orbit complexity (which is strongly related to the entropy of the system). ...
متن کاملImage encryption based on chaotic tent map in time and frequency domains
The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...
متن کاملRegular and chaotic orbits in barred galaxies - I. Applying the SALI/GALI method to explore their distribution in several models
The distinction between chaotic and regular behavior of orbits in galactic models is an important issue and can help our understanding of galactic dynamical evolution. In this paper, we deal with this issue by applying the techniques of the Smaller (and Generalized) ALingment Indices, SALI (and GALI), to extensive samples of orbits obtained by integrating numerically the equations of motion in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006